Local Connectivity of Uncertain Random Graphs
نویسندگان
چکیده
منابع مشابه
Connectivity of Metric Random Graphs
For any given r ≥ 0, a random set of n points X1, . . . , Xn in the unit disc in the Euclidean plane induces a metric random graph G(n, r) with vertex set {1, . . . , n} and edge set { {i, j} : |Xi − Xj| ≤ r } where |Xi − Xj| denotes the Euclidean distance between the points Xi and Xj. Connectivity results analogous to the classical results of Erdös and Renyi forGn,p are shown to hold in this s...
متن کاملConnectivity of random addable graphs
A non-empty class A of labelled graphs is weakly addable if for each graph G ∈ A and any two distinct components of G, any graph that can be obtain by adding an edge between the two components is also in A. For a weakly addable graph class A, we consider a random element Rn chosen uniformly from the set of all graph in A on the vertex set {1, . . . , n}. McDiarmid, Steger and Welsh conjecture [...
متن کاملConnectivity of inhomogeneous random graphs
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c logn/n. We draw n independent points Xi from a general distribution on a separable metric space, and let their indices form the vertex set of a graph. An edge (i, j) is added with probability min(1, κ(Xi, Xj) logn/n), where κ ≥ 0 i...
متن کاملLocal limits of random graphs
A graph G is a couple G = (V, E) where V denotes the set of vertices of G and V the set of undirected edges. We will assume that the graphs considered are simple, that is they do not have multiple edge nor loop. The degree deg(v) of a vertex v of G is the number of edges attached to v. In the following except explicitly mentioned all the graphs considered are locally finite (no vertex of infini...
متن کاملδ-Connectivity in Random Lifts of Graphs
Amit and Linial have shown that a random lift of a connected graph with minimum degree δ > 3 is asymptotically almost surely (a.a.s.) δ-connected and mentioned the problem of estimating this probability as a function of the degree of the lift. Using a connection between a random n-lift of a graph and a randomly generated subgroup of the symmetric group on n-elements, we show that this probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3004242